Rethinking Eventual Consistency: Can we do better?
نویسنده
چکیده
Today's data-driven internet-facing applications pose unprecedented challenges to the database systems that back these application. In addition to the immense scale of data, thousands of concurrent requests, and low latency response, these applications also strive for 24X7 availability. The big data serving systems empowering these applications must therefore have low request latencies, be highly-available, and be geo-replicated. As a result, there has been a resurgence of work on replicated, distributed database systems to meet the demands of intermittently-connected clients and of disaster-tolerant databases that span data centers spanning the globe. Many of these data serving systems weaken the criteria for replicaconsistency or isolation, and in some cases add new mechanisms, to improve partition-tolerance, availability, and performance. In this talk, I'll present a framework for comparing these criteria and mechanisms, to help architects navigate through this complex design space and reason about the various weak forms of replica consistency. Joint work with Philip A. Bernstein. Biography Sudipto Das is a Researcher in the Extreme Computing Group (XCG) at Microsoft Research (MSR) in Redmond, WA, USA. He received his Ph.D. in Computer Science from University of California Santa Barbara (UCSB). His research interests are in the broad area of scalable, distributed, and multi-tenant DBMSs for cloud platforms. Dr. Das is the recipient of the 2013 ACM SIGMOD Jim Gray Doctoral Dissertation Award, UCSB's 2012 Lancaster Dissertation Award, the CIDR 2011 Best Paper Award, MDM 2011 Best Runner-up Paper Award, the 2012 Outstanding Dissertation Award in Computer Science, and the 2011 Outstanding Student Award in Computer Science at UC Santa Barbara, and the TCS-JU Best Student Award for 2006. The 19th International Conference on Management of Data (COMAD), 19th-21st Dec, 2013 at Ahmedabad, India. Copyright © 2013 Computer Society of India (CSI)
منابع مشابه
Eventually Consistent Transactions
When distributed clients query or update shared data, eventual consistency can provide better availability than strong consistency models. However, programming and implementing such systems can be difficult unless we establish a reasonable consistency model, i.e. some minimal guarantees that programmers can understand and systems can provide effectively. To this end, we propose a novel consiste...
متن کاملOptimized OR-Sets without Ordering Constraints
Eventual consistency is a relaxation of strong consistency that guarantees that if no new updates are made to a replicated data object, then all replicas will converge. The conflict free replicated datatypes (CRDTs) of Shapiro et al. are data structures whose inherent mathematical structure guarantees eventual consistency. We investigate a fundamental CRDT called Observed-Remove Set (OR-Set) th...
متن کاملOptimistic Execution in Key-Value Store
Limitations of CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system design. We focus on the problem of what a designer should do if she has an algorithm that works correctly with sequential consistency but is faced with an underlying key-value store that provides a ...
متن کاملData Consistency Properties and the Trade-offs in Commercial Cloud Storage: the Consumers' Perspective
A new class of data storage systems, called NoSQL (Not Only SQL), have emerged to complement traditional database systems, with rejection of general ACID transactions as one common feature. Different platforms, and indeed different primitives within one NoSQL platform, can offer various consistency properties, from Eventual Consistency to single-entity ACID. For the platform provider, weaker co...
متن کاملClosing The Performance Gap between Causal Consistency and Eventual Consistency
It is well known that causal consistency is more expensive to implement than eventual consistency due to its requirement of dependency tracking and checking for causality. To close the performance gap between the two consistency models, we propose a new protocol that implements causal consistency for both partitioned and replicated data stores. Our protocol trades the visibility latency of upda...
متن کامل